Erratum: Long-Range Frustration in a Spin-Glass Model of the Vertex-Cover Problem [Phys. Rev. Lett. 94, Haijun Zhou State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Chinese Ac

Source URL: www.itp.ac.cn

Integrality gaps of 2 − o(1) for Vertex Cover SDPs in the Lov´asz-Schrijver hierarchy Konstantinos Georgiou Avner Magen

Source URL: www.cs.toronto.edu

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover Grant Schoenebeck∗ Luca Trevisan†

Source URL: ttic.uchicago.edu

A Local 2-approximation Algorithm for the Vertex Cover Problem Matti ˚ Astrand, Patrik Flor´een, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto Helsinki Institute for Information Technology HIIT, Univ

Source URL: www.tik.ee.ethz.ch

Draft: June 1, 2013 No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover Mika G¨oo¨ s · Jukka Suomela

Source URL: www.cs.utoronto.ca

Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Source URL: www.csc.kth.se

Planar Vertex Cover [Lichtensteinvariable clause

Source URL: courses.csail.mit.edu

Approximability of Vertex Cover in Dense Bipartite Hypergraphs Jean Cardinal∗ Marek Karpinski‡

Source URL: theory.cs.uni-bonn.de

Approximating Vertex Cover in Dense Hypergraphs Jean Cardinal∗ Marek Karpinski‡

Source URL: theory.cs.uni-bonn.de